A Paradigm for Probabilistic Path Planning
نویسندگان
چکیده
4 Application to nonholonomic robots, and experimental results 12 4.1 Application to general carlike robots . . . . . . . . . . . . . . . . . . . . . . . 14 4.1.1 Filling in the details . . . . . . . . . . . . . . . . . . . . . . . . . . . . 15 4.1.2 Experimental results . . . . . . . . . . . . . . . . . . . . . . . . . . . . 16 4.2 Application to forward carlike robots . . . . . . . . . . . . . . . . . . . . . . . 17 4.2.1 Experimental results . . . . . . . . . . . . . . . . . . . . . . . . . . . . 18 4.3 Application to tractor-trailer robots . . . . . . . . . . . . . . . . . . . . . . . 18 4.3.1 Experimental results . . . . . . . . . . . . . . . . . . . . . . . . . . . . 19
منابع مشابه
Linear Time Varying MPC Based Path Planning of an Autonomous Vehicle via Convex Optimization
In this paper a new method is introduced for path planning of an autonomous vehicle. In this method, the environment is considered cluttered and with some uncertainty sources. Thus, the state of detected object should be estimated using an optimal filter. To do so, the state distribution is assumed Gaussian. Thus the state vector is estimated by a Kalman filter at each time step. The estimation...
متن کاملΝ☆: a Robot Path Planning Algorithm Based on Renormalised Measure of Probabilistic Regular Languages
This article introduces a novel path planning algorithm, called m, that reduces the problem of robot path planning to optimisation of a probabilistic finite state automaton. The m-algorithm makes use of renormalised measure m of regular languages to plan the optimal path for a specified goal. Although the underlying navigation model is probabilistic, the m-algorithm yields path plans that can b...
متن کاملProbabilistic Planning by Probabilistic Programming
Automated planning is a major topic of research in artificial intelligence, and enjoys a long and distinguished history. The classical paradigm assumes a distinguished initial state, comprised of a set of facts, and is defined over a set of actions which change that state in one way or another. Planning in many real-world settings, however, is much more involved: an agent’s knowledge is almost ...
متن کاملOn Probabilistic Completeness of Probabilistic Cell Decomposition
Probabilistic Cell Decomposition (PCD) is a probabilistic path planning method combining the concepts of approximate cell decomposition with probabilistic sampling. It has been shown that the use of lazy evaluation techniques and supervised sampling in important areas result in a high performance path planning method. Even if it was postulated before that PCD is probabilistically complete, we p...
متن کاملA Multi-stage Probabilistic Algorithm for Dynamic Path-Planning
Probabilistic sampling methods have become very popular to solve single-shot path planning problems. Rapidlyexploring Random Trees (RRTs) in particular have been shown to be efficient in solving high dimensional problems. Even though several RRT variants have been proposed for dynamic replanning, these methods only perform well in environments with infrequent changes. This paper addresses the d...
متن کامل